0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : run_vampire %s %d THM
0.13/0.32	% Computer   : n009.cluster.edu
0.13/0.32	% Model      : x86_64 x86_64
0.13/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.32	% Memory     : 8042.1875MB
0.13/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.32	% CPULimit   : 1920
0.13/0.32	% WCLimit    : 240
0.13/0.32	% DateTime   : Wed Jul 30 02:14:19 EDT 2025
0.13/0.32	% CPUTime    : 
0.13/0.34	This is a THF_ problem
0.13/0.35	Running higher-order theorem proving
0.13/0.35	Running /export/starexec/sandbox2/solver/bin/vampire-hol --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --print_def_sorts on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/tmp/tmp.OUpRl1k1pi/E---3.1_30621.p -m 16384 -t 240
0.21/0.37	% (30809)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on E---3.1_30621 for (2399ds/4Mi)
0.21/0.38	% (30808)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on E---3.1_30621 for (2399ds/183Mi)
0.21/0.38	% (30809)Instruction limit reached!
0.21/0.38	% (30809)------------------------------
0.21/0.38	% (30809)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
0.21/0.38	% (30809)Termination reason: Unknown
0.21/0.38	% (30809)Termination phase: Saturation
0.21/0.38	
0.21/0.38	% (30809)Memory used [KB]: 5500
0.21/0.38	% (30809)Time elapsed: 0.005 s
0.21/0.38	% (30809)Instructions burned: 5 (million)
0.21/0.38	% (30809)------------------------------
0.21/0.38	% (30809)------------------------------
0.21/0.38	% (30808)First to succeed.
0.21/0.38	% (30808)Refutation found. Thanks to Tanya!
0.21/0.38	% SZS status Theorem for E---3.1_30621
0.21/0.38	% SZS output start Proof for E---3.1_30621
0.21/0.38	thf(func_def_0, type, cN: $i > $i).
0.21/0.38	thf(func_def_1, type, cM: $i > $i).
0.21/0.38	thf(func_def_5, type, sK0: ($i > $i) > $o).
0.21/0.38	thf(func_def_8, type, ph2: !>[X0: $tType]:(X0)).
0.21/0.38	thf(f99,plain,(
0.21/0.38	  $false),
0.21/0.38	  inference(avatar_sat_refutation,[status(thm)],[f23,f32,f38,f77,f96,f98])).
0.21/0.38	thf(f98,plain,(
0.21/0.38	  spl1_2 | spl1_3),
0.21/0.38	  inference(avatar_contradiction_clause,[status(thm)],[f97])).
0.21/0.38	thf(f97,plain,(
0.21/0.38	  $false | (spl1_2 | spl1_3)),
0.21/0.38	  inference(subsumption_resolution,[status(thm)],[f87,f21])).
0.21/0.38	thf(f21,plain,(
0.21/0.38	  ((sK0 @ cN) != $true) | spl1_2),
0.21/0.38	  inference(avatar_component_clause,[status(thm)],[f20])).
0.21/0.38	thf(f20,definition,(
0.21/0.38	  spl1_2 <=> ((sK0 @ cN) = $true)),
0.21/0.38	  introduced(definition,[new_symbols(naming,[spl1_2])],[avatar_definition])).
0.21/0.38	thf(f87,plain,(
0.21/0.38	  ((sK0 @ cN) = $true) | spl1_3),
0.21/0.38	  inference(beta_eta_normalization,[status(thm)],[f86])).
0.21/0.38	thf(f86,plain,(
0.21/0.38	  ( ! [X0 : $i] : (($true = ((^[Y0 : $i]: (sK0 @ ((^[Y1 : $i]: ((^[Y2 : $i]: (cN @ ((^[Y3 : $i]: ((^[Y4 : $i]: (Y4)))) @ Y1 @ Y2))))) @ Y0))) @ (cN @ X0)))) ) | spl1_3),
0.21/0.38	  inference(trivial_inequality_removal,[status(thm)],[f85])).
0.21/0.38	thf(f85,plain,(
0.21/0.38	  ( ! [X0 : $i] : (($false != $false) | ($true = ((^[Y0 : $i]: (sK0 @ ((^[Y1 : $i]: ((^[Y2 : $i]: (cN @ ((^[Y3 : $i]: ((^[Y4 : $i]: (Y4)))) @ Y1 @ Y2))))) @ Y0))) @ (cN @ X0)))) ) | spl1_3),
0.21/0.38	  inference(superposition,[status(thm)],[f26,f11])).
0.21/0.38	thf(f11,plain,(
0.21/0.38	  ( ! [X0 : $i,X1 : $i > $o] : (((X1 @ (cM @ X0)) = $false) | ((X1 @ (cN @ X0)) = $true)) )),
0.21/0.38	  inference(binary_proxy_clausification,[status(thm)],[f10])).
0.21/0.38	thf(f10,plain,(
0.21/0.38	  ( ! [X0 : $i,X1 : $i > $o] : (((X1 @ (cN @ X0)) = (X1 @ (cM @ X0)))) )),
0.21/0.38	  inference(cnf_transformation,[status(thm)],[f8])).
0.21/0.38	thf(f8,plain,(
0.21/0.38	  ! [X0 : $i,X1 : $i > $o] : ((X1 @ (cN @ X0)) = (X1 @ (cM @ X0))) & ((sK0 @ cN) != (sK0 @ cM))),
0.21/0.38	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7])).
0.21/0.38	thf(f7,plain,(
0.21/0.38	  ? [X2 : ($i > $i) > $o] : ((X2 @ cM) != (X2 @ cN)) => ((sK0 @ cN) != (sK0 @ cM))),
0.21/0.38	  introduced(definition,[],[choice_axiom])).
0.21/0.38	thf(f6,plain,(
0.21/0.38	  ! [X0 : $i,X1 : $i > $o] : ((X1 @ (cN @ X0)) = (X1 @ (cM @ X0))) & ? [X2 : ($i > $i) > $o] : ((X2 @ cM) != (X2 @ cN))),
0.21/0.38	  inference(ennf_transformation,[status(thm)],[f5])).
0.21/0.38	thf(f5,plain,(
0.21/0.38	  ~(! [X0 : $i,X1 : $i > $o] : ((X1 @ (cN @ X0)) = (X1 @ (cM @ X0))) => ! [X2 : ($i > $i) > $o] : ((X2 @ cM) = (X2 @ cN)))),
0.21/0.38	  inference(fool_elimination,[status(thm)],[f4])).
0.21/0.38	thf(f4,plain,(
0.21/0.38	  ~(! [X0 : $i,X1 : $i > $o] : ((X1 @ (cM @ X0)) <=> (X1 @ (cN @ X0))) => ! [X2 : ($i > $i) > $o] : ((X2 @ cM) <=> (X2 @ cN)))),
0.21/0.38	  inference(rectify,[status(thm)],[f2])).
0.21/0.38	thf(f2,negated_conjecture,(
0.21/0.38	  ~(! [X1 : $i,X2 : $i > $o] : ((X2 @ (cM @ X1)) <=> (X2 @ (cN @ X1))) => ! [X0 : ($i > $i) > $o] : ((X0 @ cM) <=> (X0 @ cN)))),
0.21/0.38	  inference(negated_conjecture,[status(cth)],[f1])).
0.21/0.38	thf(f1,conjecture,(
0.21/0.38	  ! [X1 : $i,X2 : $i > $o] : ((X2 @ (cM @ X1)) <=> (X2 @ (cN @ X1))) => ! [X0 : ($i > $i) > $o] : ((X0 @ cM) <=> (X0 @ cN))),
0.21/0.38	  file('/export/starexec/sandbox2/tmp/tmp.OUpRl1k1pi/E---3.1_30621.p',cEXT_A_LEIB2)).
0.21/0.38	thf(f26,plain,(
0.21/0.38	  ((sK0 @ cN) != $false) | spl1_3),
0.21/0.38	  inference(avatar_component_clause,[status(thm)],[f25])).
0.21/0.38	thf(f25,definition,(
0.21/0.38	  spl1_3 <=> ((sK0 @ cN) = $false)),
0.21/0.38	  introduced(definition,[new_symbols(naming,[spl1_3])],[avatar_definition])).
0.21/0.38	thf(f96,plain,(
0.21/0.38	  ~spl1_2 | ~spl1_4),
0.21/0.38	  inference(avatar_contradiction_clause,[status(thm)],[f95])).
0.21/0.38	thf(f95,plain,(
0.21/0.38	  $false | (~spl1_2 | ~spl1_4)),
0.21/0.38	  inference(subsumption_resolution,[status(thm)],[f94,f47])).
0.21/0.38	thf(f47,plain,(
0.21/0.38	  ( ! [X0 : $i] : (((cN @ X0) = (cM @ X0))) )),
0.21/0.38	  inference(leibniz_equality_elimination,[status(thm)],[f11])).
0.21/0.38	thf(f94,plain,(
0.21/0.38	  ((cN @ sK4) != (cM @ sK4)) | (~spl1_2 | ~spl1_4)),
0.21/0.38	  inference(negative_extensionality,[status(thm)],[f93])).
0.21/0.38	thf(f93,plain,(
0.21/0.38	  (cN != cM) | (~spl1_2 | ~spl1_4)),
0.21/0.38	  inference(trivial_inequality_removal,[status(thm)],[f88])).
0.21/0.38	thf(f88,plain,(
0.21/0.38	  ($true = $false) | (cN != cM) | (~spl1_2 | ~spl1_4)),
0.21/0.38	  inference(constrained_superposition,[status(thm)],[f31,f22])).
0.21/0.38	thf(f22,plain,(
0.21/0.38	  ((sK0 @ cN) = $true) | ~spl1_2),
0.21/0.38	  inference(avatar_component_clause,[status(thm)],[f20])).
0.21/0.38	thf(f31,plain,(
0.21/0.38	  ($false = (sK0 @ cM)) | ~spl1_4),
0.21/0.38	  inference(avatar_component_clause,[status(thm)],[f29])).
0.21/0.38	thf(f29,definition,(
0.21/0.38	  spl1_4 <=> ($false = (sK0 @ cM))),
0.21/0.38	  introduced(definition,[new_symbols(naming,[spl1_4])],[avatar_definition])).
0.21/0.38	thf(f77,plain,(
0.21/0.38	  ~spl1_1 | ~spl1_3),
0.21/0.38	  inference(avatar_contradiction_clause,[status(thm)],[f76])).
0.21/0.38	thf(f76,plain,(
0.21/0.38	  $false | (~spl1_1 | ~spl1_3)),
0.21/0.38	  inference(trivial_inequality_removal,[status(thm)],[f74])).
0.21/0.38	thf(f74,plain,(
0.21/0.38	  ((cN @ sK3) != (cN @ sK3)) | (~spl1_1 | ~spl1_3)),
0.21/0.38	  inference(superposition,[status(thm)],[f43,f47])).
0.21/0.38	thf(f43,plain,(
0.21/0.38	  ((cN @ sK3) != (cM @ sK3)) | (~spl1_1 | ~spl1_3)),
0.21/0.38	  inference(negative_extensionality,[status(thm)],[f42])).
0.21/0.38	thf(f42,plain,(
0.21/0.38	  (cN != cM) | (~spl1_1 | ~spl1_3)),
0.21/0.38	  inference(trivial_inequality_removal,[status(thm)],[f39])).
0.21/0.38	thf(f39,plain,(
0.21/0.38	  (cN != cM) | ($true = $false) | (~spl1_1 | ~spl1_3)),
0.21/0.38	  inference(constrained_superposition,[status(thm)],[f18,f27])).
0.21/0.38	thf(f27,plain,(
0.21/0.38	  ((sK0 @ cN) = $false) | ~spl1_3),
0.21/0.38	  inference(avatar_component_clause,[status(thm)],[f25])).
0.21/0.38	thf(f18,plain,(
0.21/0.38	  ($true = (sK0 @ cM)) | ~spl1_1),
0.21/0.38	  inference(avatar_component_clause,[status(thm)],[f16])).
0.21/0.38	thf(f16,definition,(
0.21/0.38	  spl1_1 <=> ($true = (sK0 @ cM))),
0.21/0.38	  introduced(definition,[new_symbols(naming,[spl1_1])],[avatar_definition])).
0.21/0.38	thf(f38,plain,(
0.21/0.38	  ~spl1_2 | ~spl1_3),
0.21/0.38	  inference(avatar_contradiction_clause,[status(thm)],[f37])).
0.21/0.38	thf(f37,plain,(
0.21/0.38	  $false | (~spl1_2 | ~spl1_3)),
0.21/0.38	  inference(trivial_inequality_removal,[status(thm)],[f33])).
0.21/0.38	thf(f33,plain,(
0.21/0.38	  ($true = $false) | (~spl1_2 | ~spl1_3)),
0.21/0.38	  inference(superposition,[status(thm)],[f27,f22])).
0.21/0.38	thf(f32,plain,(
0.21/0.38	  spl1_3 | spl1_4),
0.21/0.38	  inference(avatar_split_clause,[status(thm)],[f14,f29,f25])).
0.21/0.38	thf(f14,plain,(
0.21/0.38	  ((sK0 @ cN) = $false) | ($false = (sK0 @ cM))),
0.21/0.38	  inference(binary_proxy_clausification,[status(thm)],[f9])).
0.21/0.38	thf(f9,plain,(
0.21/0.38	  ((sK0 @ cN) != (sK0 @ cM))),
0.21/0.38	  inference(cnf_transformation,[status(thm)],[f8])).
0.21/0.38	thf(f23,plain,(
0.21/0.38	  spl1_1 | spl1_2),
0.21/0.38	  inference(avatar_split_clause,[status(thm)],[f13,f20,f16])).
0.21/0.38	thf(f13,plain,(
0.21/0.38	  ($true = (sK0 @ cM)) | ((sK0 @ cN) = $true)),
0.21/0.38	  inference(binary_proxy_clausification,[status(thm)],[f9])).
0.21/0.38	% SZS output end Proof for E---3.1_30621
0.21/0.38	% (30808)------------------------------
0.21/0.38	% (30808)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
0.21/0.38	% (30808)Termination reason: Refutation
0.21/0.38	
0.21/0.38	% (30808)Memory used [KB]: 5500
0.21/0.38	% (30808)Time elapsed: 0.008 s
0.21/0.38	% (30808)Instructions burned: 6 (million)
0.21/0.38	% (30808)------------------------------
0.21/0.38	% (30808)------------------------------
0.21/0.38	% (30807)Success in time 0.026 s
0.21/0.39	EOF